Strategy-Proof and Efficient Offline Interval Scheduling and Cake Cutting
نویسنده
چکیده
I construct a class of strategy-proof and Pareto efficient mechanisms of cake cutting in the context of offline interval scheduling. The motivating application is the circulation of the single copy of a book owned by a public library among all self-interested and rational potential readers with piecewise uniform value densities over continuous time intervals. The class of mechanisms accommodate both anonymous and non-anonymous configurations and can serve as a flexible platform to implement allocations of heterogeneous goods according to distributional objectives such as arbitrary guaranteed shares of reported demand.
منابع مشابه
Fairness and False-Name Manipulations in Randomized Cake Cutting
Cake cutting has been recognized as a fundamental model in fair division, and several envy-free cake cutting algorithms have been proposed. Recent works from the computer science field proposed novelmechanisms for cake cutting, whose approaches are based on the theory of mechanism design; these mechanisms are strategy-proof, i.e., no agent has any incentive to misrepresent her utility function,...
متن کاملA Dictatorship Theorem for Cake Cutting
We consider discrete protocols for the classical Steinhaus cake cutting problem. Under mild technical conditions, we show that any deterministic strategy-proof protocol for two agents in the standard Robertson-Webb query model is dictatorial, that is, there is a fixed agent to which the protocol allocates the entire cake. For n > 2 agents, a similar impossibility holds, namely there always exis...
متن کاملCutting a Cake with both Good and Bad Parts
There is a heterogeneous resource that contains both good parts and bad parts, for example, a cake with some parts burnt, a land-estate with some parts heavily taxed, or a chore with some parts fun to do. The resource has to be divided fairly among n agents, each of whom has a personal value-density function on the resource. The value-density functions can accept any real value positive or nega...
متن کاملMeta-Envy-Free Cake-Cutting Protocols
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta-envy-freeness of cake-cutting, which has not been formally considered before. Though envy-freeness was considered to be one of the most important desirable properties, envy-freeness does not prevent envy about role a...
متن کاملA Cryptographic Moving-Knife Cake-Cutting Protocol
This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...
متن کامل